Exact Quantum Search by Parallel Unitary Discrimination Schemes
نویسندگان
چکیده
2 3 N + o(N) of the number of queries for any parallel scheme with unentangled input states. With the assistance of entanglement, we obtain a general lower bound 1 2 (N − √ N). We provide concrete examples to illustrate our results. In particular, we show that the case of N = 6 can be solved exactly with only two queries by using a bipartite entangled input state. Our results indicate that in the standard oracle model the complexity of exact quantum search with one unique solution can be strictly less than that of the calculation of OR function.
منابع مشابه
Linear-Optical Implementation of Perfect Discrimination between Single-bit Unitary Operations
For quantum computing and quantum information processing, one important task is the discrimination of quantum states and unitary operations. This is strongly related to quantum nonorthogonality, which is one of the basic features of quantum mechanics. Since the pioneering work of Helstrom [1] on quantum hypothesis testing, the problem of discriminating nonorthogonal quantum states has attracted...
متن کاملGeneralized Quantum Search with Parallelism
We generalize Grover’s unstructured quantum search algorithm to enable it to use an arbitrary starting superposition and an arbitrary unitary matrix simultaneously. We derive an exact formula for the probability of the generalized Grover’s algorithm succeeding after n iterations. We show that the fully generalized formula reduces to the special cases considered by previous authors. We then use ...
متن کاملCan Quantum Entanglement Detection Schemes Improve Search?
Quantum computation, in particular Grover’s algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an N element database require at most O(N) time complexity. Grover’s algorithm is able to find a solution with high probability in O( √ N ) time through an amplitude amplification scheme. In this ...
متن کاملMemory effects in quantum channel discrimination.
We consider quantum-memory assisted protocols for discriminating quantum channels. We show that for optimal discrimination of memory channels, memory assisted protocols are needed. This leads to a new notion of distance for channels with memory, based on the general theory of quantum testers. For discrimination and estimation of sets of independent unitary channels, we prove optimality of paral...
متن کاملPT -symmetric Hamiltonians and their application in quantum information
We discuss the prospect of PT -symmetric Hamiltonians finding applications in quantum information science, and conclude that such evolution is unlikely to provide any benefit over existing techniques. Although it has been known for some time that PT -symmetric quantum theory, when viewed as a unitary theory, is exactly equivalent to standard quantum mechanics, proposals continue to be put forwa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008